Gallai-Ramsey Numbers for Monochromatic K + 4 or K 3
نویسندگان
چکیده
منابع مشابه
Ramsey - type problem for an almost monochromatic K 4 Jacob
In this short note we prove that there is a constant c such that every k-edge-coloring of the complete graph Kn with n ≥ 2 contains a K4 whose edges receive at most two colors. This improves on a result of Kostochka and Mubayi, and is the first exponential bound for this problem.
متن کاملNew Computational Upper Bounds for Ramsey Numbers R(3, k)
Using computational techniques we derive six new upper bounds on the classical twocolor Ramsey numbers: R(3, 10) ≤ 42, R(3, 11) ≤ 50, R(3, 13) ≤ 68, R(3, 14) ≤ 77, R(3, 15) ≤ 87, and R(3, 16) ≤ 98. All of them are improvements by one over the previously best published bounds. Let e(3, k, n) denote the minimum number of edges in any triangle-free graph on n vertices without independent sets of o...
متن کاملAll Ramsey numbers r ( K 3 , G ) for connected graphs of order 9 Stephan Brandt
We determine the Ramsey numbers r(K3, G) for all 261080 connected graphs of order 9 and further Ramsey numbers of this type for some graphs of order up to 12. Almost all of them were determined by computer programs which are based on a program for generating maximal triangle-free graphs.
متن کاملEMBEDDINGS AND RAMSEY NUMBERS OF SPARSE k-UNIFORM HYPERGRAPHS
Chvátal, Rödl, Szemerédi and Trotter [3] proved that the Ramsey numbers of graphs of bounded maximum degree are linear in their order. In [6, 23] the same result was proved for 3-uniform hypergraphs. Here we extend this result to k-uniform hypergraphs for any integer k ≥ 3. As in the 3-uniform case, the main new tool which we prove and use is an embedding lemma for k-uniform hypergraphs of boun...
متن کاملMonochromatic tree covers and Ramsey numbers for set-coloured graphs
We extend results on monochromatic tree covers and from classical Ramsey theory to a generalised setting, where each of the edges of an underlying host graph (here, either a complete graph or a complete bipartite graph), is coloured with a set of colours. Our results for tree covers in this setting have an application to Ryser’s Conjecture. Every r-partite r-uniform hypergraph whose edges pairw...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: An interdisciplinary journal of discontinuity, nonlinearity, and complexity
سال: 2022
ISSN: ['2164-6414', '2164-6376']
DOI: https://doi.org/10.5890/dnc.2022.06.005